منابع مشابه
Multi-Multiway Cut Problem on Graphs of Bounded Branch Width
The Multi-Multiway Cut problem proposed by Avidor and Langberg[2] is a natural generalization of Multicut and Multiway Cut problems. That is, given a simple graphG and c sets of vertices S1, · · · , Sc, the problem asks for a minimum set of edges whose removal disconnects every pair of vertices in Si for all 1 ≤ i ≤ c. In [13], the authors asked whether the problem is polynomial time solvable f...
متن کاملSimplex Transformations and the Multiway Cut Problem
We consider Multiway Cut, a basic graph partitioning problem in which the goal is to find the minimum weight collection of edges disconnecting a given set of special vertices called terminals. Multiway Cut admits a well known simplex embedding relaxation, where rounding this embedding is equivalent to partitioning the simplex. Current best known solutions to the problem are comprised of a mix o...
متن کاملOn a bidirected relaxation for the MULTIWAY CUT problem
In the Multiway Cut problem, we are given an undirected edge-weighted graph G = (V; E) with c e denoting the cost (weight) of edge e. We are also given a subset S of V , of size k, called the terminals. The objective is to nd a minimum cost set of edges whose removal ensures that the terminals are disconnected. In this paper, we study a bidirected linear programming relaxation of Multiway Cut. ...
متن کاملMin-Max Multiway Cut
We propose the Min-max multiway cut problem, a variant of the traditional Multiway cut problem, but with the goal of minimizing the maximum capacity (rather than the sum or average capacity) leaving a part of the partition. The problem is motivated by data partitioning in Peer-to-Peer networks. The min-max objective function forces the solution not to overload any given terminal, and hence may ...
متن کاملMulti-Atlas Brain MRI Segmentation with Multiway Cut
Characterization of anatomical structure of the brain and efficient algorithms for automatically analyzing brain MRI have gained an increasing interest in recent years. In this paper, we propose an algorithm that automatically segments the anatomical structures of magnetic resonance human brain images. Our method uses the prior knowledge of labels given by experts to statistically investigate t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2007
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2007.02.026